Response Time Approximations in Fork-Join Queues
نویسندگان
چکیده
Fork-join queueing networks model a network of parallel servers in which an arriving job splits into a number of subtasks that are serviced in parallel. Fork-join queues can be used to model disk arrays. A response time approximation of the fork-join queue is presented that attempts to comply with the additional constraints of modelling a disk array. This approximation is compared with existing analytical approximations of the fork-join queueing network.
منابع مشابه
The M/M/1 Fork-Join Queue with Variable Sub-Tasks
The fork-join queue models parallel resources where arriving jobs divide into various number of sub-tasks that are assigned to unique devices within the parallel resource. Each device in the parallel resource is modeled by M=M=1 queueing servers. A job completes execution and departs the parallel resource after all its sub-tasks complete execution. This paper analyzes N-server fork-join queues ...
متن کاملReduction of Subtask Dispersion in Fork-Join Systems
Fork-join and split-merge queueing systems are well-known abstractions of parallel systems in which each incoming task splits into subtasks that are processed by a set of parallel servers. A task exits the system when all of its subtasks have completed service. Two key metrics of interest in such systems are task response time and subtask dispersion. This paper presents a technique applicable t...
متن کامل- - - Bounds and Approximations for Overheads in the Time to Join Parallel
This paper studies the effects of overheads in massively parallel processing. The execution times for tasks on individual processors are modeled as independent and identically but arbitrarily distributed random variables. The time to execute a process fork is assumed to be distributed exponentially. The main result bounds (in expectation) the overhead time in forking a large number of tasks acr...
متن کاملBounds and Approximations for Overheads in the Time to Join Parallel Forks
This paper studies the effects of overheads in massively parallel processing. The execution times for tasks on individual processors are modeled as independent and identically but arbitrarily distributed random variables. The time to execute a process fork is assumed to be distributed exponentially. The main result bounds (in expectation) the overhead time in forking a large number of tasks acr...
متن کاملTwo Moment Approximations for Fork/Join Stations with Applications to Modeling Kanban Systems
In queuing models of kanban systems, fork/join stations are used to model the synchronization constraints between parts and kanbans. Efficient analysis of these fork/join stations is quite crucial to analytical performance evaluation of kanban systems. Exact analysis of the fork/join station can be difficult especially if the input processes have general characteristics. We propose a new method...
متن کامل